Job Scheduling Scheme for Pure Space Sharingamong Rigid
نویسندگان
چکیده
This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors eeciently. This paper evaluates the performance of job scheduling schemes that are proposed to alleviate the drawback of FCFS by simulation, performance analysis and experiments on a real multiprocessor system. The results showed that Fit Processors First Served (FPFS), which searches the job queue and positively dispatches jobs that t idle processors, was more eeective and more practical than others.
منابع مشابه
Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs
This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors e ciently. This paper evaluates the performance of job scheduling schemes that are propose...
متن کاملMoldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach
Currently, job schedulers require “rigid” job submissions from users, who must specify a particular number of processors for each parallel job. Most parallel jobs can be run on different processor partition sizes, but there is often a trade-off between wait-time and run-time — asking for many processors reduces run-time but may require a protracted wait. With moldable scheduling, the choice of ...
متن کاملA Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs
Moldable job scheduling has been proved to be effective compared to traditionaljob scheduling policies. It is based on the observation that most jobs submitted to a spaceshared parallel system can actually reduce their response times if they were allowed to take any number of processors in a user-specified range. Previous approaches to scheduling of moldable jobs focused on when and how to choo...
متن کاملThe Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation
Over the last decade, much research in the area of scheduling has concentrated on single-cluster systems. Less attention has been paid to multicluster systems, although they are gaining more and more importance in practice. We propose a model for scheduling rigid jobs consisting of multiple components in multicluster systems by pure space sharing, based on the Distributed ASCI Supercomputer. Us...
متن کاملAn Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
ÐTraditional multiprocessor scheduling schemes have been one of either space-sharing or time-sharing. Space-sharing schemes perform better than time-sharing at low to moderate system loads. However, they have a disadvantage of wasting processing power within partitions at medium to high system loads. Time sharing schemes tend to perform better at medium to high system loads. Almost all the sche...
متن کامل